0.03/0.13 % Problem : Vampire---4.8_22965 : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : run_E %s %d THM 0.11/0.32 % Computer : n012.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 1440 0.11/0.32 % WCLimit : 180 0.11/0.32 % DateTime : Mon Jul 3 13:05:22 EDT 2023 0.11/0.32 % CPUTime : 0.15/0.49 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.lp8OSfGxUb/Vampire---4.8_22965 0.15/0.50 # Version: 3.1pre001-ho 0.44/0.68 # Preprocessing class: HSLSSMSSSSLCHFA. 0.44/0.68 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.44/0.68 # Starting ehoh_best4 with 900s (5) cores 0.44/0.68 # Starting additional_ho_6 with 180s (1) cores 0.44/0.68 # Starting new_bool_3 with 180s (1) cores 0.44/0.68 # Starting new_bool_1 with 180s (1) cores 0.44/0.68 # additional_ho_6 with pid 23290 completed with status 0 0.44/0.68 # Result found by additional_ho_6 0.44/0.68 # Preprocessing class: HSLSSMSSSSLCHFA. 0.44/0.68 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.44/0.68 # Starting ehoh_best4 with 900s (5) cores 0.44/0.68 # Starting additional_ho_6 with 180s (1) cores 0.44/0.68 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0) 0.44/0.68 # Search class: HGHSM-FSLM32-MHFFFSBN 0.44/0.68 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.44/0.68 # Starting sh9 with 98s (1) cores 0.44/0.68 # sh9 with pid 23309 completed with status 0 0.44/0.68 # Result found by sh9 0.44/0.68 # Preprocessing class: HSLSSMSSSSLCHFA. 0.44/0.68 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.44/0.68 # Starting ehoh_best4 with 900s (5) cores 0.44/0.68 # Starting additional_ho_6 with 180s (1) cores 0.44/0.68 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0) 0.44/0.68 # Search class: HGHSM-FSLM32-MHFFFSBN 0.44/0.68 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.44/0.68 # Starting sh9 with 98s (1) cores 0.44/0.68 # Preprocessing time : 0.017 s 0.44/0.68 # Presaturation interreduction done 0.44/0.68 0.44/0.68 # Proof found! 0.44/0.68 # SZS status Theorem 0.44/0.68 # SZS output start CNFRefutation 0.44/0.68 thf(decl_22, type, binary717961607le_T_a: binary1439146945Tree_a > a > binary1439146945Tree_a > binary1439146945Tree_a). 0.44/0.68 thf(decl_29, type, binary945792244etOf_a: binary1439146945Tree_a > set_a). 0.44/0.68 thf(decl_30, type, binary1721989714Tree_a: (a > int) > binary1439146945Tree_a > $o). 0.44/0.68 thf(decl_45, type, ord_less_int: int > int > $o). 0.44/0.68 thf(decl_54, type, member_a: a > set_a > $o). 0.44/0.68 thf(decl_56, type, h: a > int). 0.44/0.68 thf(decl_57, type, t1: binary1439146945Tree_a). 0.44/0.68 thf(decl_58, type, t2: binary1439146945Tree_a). 0.44/0.68 thf(decl_59, type, w: a). 0.44/0.68 thf(decl_60, type, x: a). 0.44/0.68 thf(decl_173, type, esk89_4: (a > int) > binary1439146945Tree_a > a > binary1439146945Tree_a > a). 0.44/0.68 thf(decl_174, type, esk90_4: (a > int) > binary1439146945Tree_a > a > binary1439146945Tree_a > a). 0.44/0.68 thf(fact_19_sortedTree_Osimps_I2_J, axiom, ![X79:a > int, X93:binary1439146945Tree_a, X7:a, X94:binary1439146945Tree_a]:(((binary1721989714Tree_a @ X79 @ (binary717961607le_T_a @ X93 @ X7 @ X94))<=>(((![X11:a]:(((member_a @ X11 @ (binary945792244etOf_a @ X93))=>(ord_less_int @ (X79 @ X11) @ (X79 @ X7))))&![X11:a]:(((ord_less_int @ (X79 @ X7) @ (X79 @ X11))<=(member_a @ X11 @ (binary945792244etOf_a @ X94)))))&(binary1721989714Tree_a @ X79 @ X94))&(binary1721989714Tree_a @ X79 @ X93)))), file('/export/starexec/sandbox/tmp/tmp.lp8OSfGxUb/Vampire---4.8_22965', fact_19_sortedTree_Osimps_I2_J)). 0.44/0.68 thf(conj_0, conjecture, (ord_less_int @ (h @ w) @ (h @ x)), file('/export/starexec/sandbox/tmp/tmp.lp8OSfGxUb/Vampire---4.8_22965', conj_0)). 0.44/0.68 thf(fact_1_s, axiom, (binary1721989714Tree_a @ h @ (binary717961607le_T_a @ t1 @ x @ t2)), file('/export/starexec/sandbox/tmp/tmp.lp8OSfGxUb/Vampire---4.8_22965', fact_1_s)). 0.44/0.68 thf(fact_0_whSet, axiom, (member_a @ w @ (binary945792244etOf_a @ t1)), file('/export/starexec/sandbox/tmp/tmp.lp8OSfGxUb/Vampire---4.8_22965', fact_0_whSet)). 0.44/0.68 thf(c_0_4, plain, ![X79:a > int, X93:binary1439146945Tree_a, X7:a, X94:binary1439146945Tree_a]:(((binary1721989714Tree_a @ X79 @ (binary717961607le_T_a @ X93 @ X7 @ X94))<=>(((![X11:a]:(((member_a @ X11 @ (binary945792244etOf_a @ X93))=>(ord_less_int @ (X79 @ X11) @ (X79 @ X7))))&![X11:a]:(((member_a @ X11 @ (binary945792244etOf_a @ X94))=>(ord_less_int @ (X79 @ X7) @ (X79 @ X11)))))&(binary1721989714Tree_a @ X79 @ X94))&(binary1721989714Tree_a @ X79 @ X93)))), inference(fof_simplification,[status(thm)],[fact_19_sortedTree_Osimps_I2_J])). 0.44/0.68 thf(c_0_5, plain, ![X2073:a > int, X2074:binary1439146945Tree_a, X2075:a, X2076:binary1439146945Tree_a, X2077:a, X2078:a, X2079:a > int, X2080:binary1439146945Tree_a, X2081:a, X2082:binary1439146945Tree_a]:((((((~(member_a @ X2077 @ (binary945792244etOf_a @ X2074))|(ord_less_int @ (X2073 @ X2077) @ (X2073 @ X2075))|~(binary1721989714Tree_a @ X2073 @ (binary717961607le_T_a @ X2074 @ X2075 @ X2076)))&(~(member_a @ X2078 @ (binary945792244etOf_a @ X2076))|(ord_less_int @ (X2073 @ X2075) @ (X2073 @ X2078))|~(binary1721989714Tree_a @ X2073 @ (binary717961607le_T_a @ X2074 @ X2075 @ X2076))))&((binary1721989714Tree_a @ X2073 @ X2076)|~(binary1721989714Tree_a @ X2073 @ (binary717961607le_T_a @ X2074 @ X2075 @ X2076))))&((binary1721989714Tree_a @ X2073 @ X2074)|~(binary1721989714Tree_a @ X2073 @ (binary717961607le_T_a @ X2074 @ X2075 @ X2076))))&((((member_a @ (esk90_4 @ X2079 @ X2080 @ X2081 @ X2082) @ (binary945792244etOf_a @ X2082))|(member_a @ (esk89_4 @ X2079 @ X2080 @ X2081 @ X2082) @ (binary945792244etOf_a @ X2080))|~(binary1721989714Tree_a @ X2079 @ X2082)|~(binary1721989714Tree_a @ X2079 @ X2080)|(binary1721989714Tree_a @ X2079 @ (binary717961607le_T_a @ X2080 @ X2081 @ X2082)))&(~(ord_less_int @ (X2079 @ X2081) @ (X2079 @ (esk90_4 @ X2079 @ X2080 @ X2081 @ X2082)))|(member_a @ (esk89_4 @ X2079 @ X2080 @ X2081 @ X2082) @ (binary945792244etOf_a @ X2080))|~(binary1721989714Tree_a @ X2079 @ X2082)|~(binary1721989714Tree_a @ X2079 @ X2080)|(binary1721989714Tree_a @ X2079 @ (binary717961607le_T_a @ X2080 @ X2081 @ X2082))))&(((member_a @ (esk90_4 @ X2079 @ X2080 @ X2081 @ X2082) @ (binary945792244etOf_a @ X2082))|~(ord_less_int @ (X2079 @ (esk89_4 @ X2079 @ X2080 @ X2081 @ X2082)) @ (X2079 @ X2081))|~(binary1721989714Tree_a @ X2079 @ X2082)|~(binary1721989714Tree_a @ X2079 @ X2080)|(binary1721989714Tree_a @ X2079 @ (binary717961607le_T_a @ X2080 @ X2081 @ X2082)))&(~(ord_less_int @ (X2079 @ X2081) @ (X2079 @ (esk90_4 @ X2079 @ X2080 @ X2081 @ X2082)))|~(ord_less_int @ (X2079 @ (esk89_4 @ X2079 @ X2080 @ X2081 @ X2082)) @ (X2079 @ X2081))|~(binary1721989714Tree_a @ X2079 @ X2082)|~(binary1721989714Tree_a @ X2079 @ X2080)|(binary1721989714Tree_a @ X2079 @ (binary717961607le_T_a @ X2080 @ X2081 @ X2082))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])])). 0.44/0.68 thf(c_0_6, negated_conjecture, ~(ord_less_int @ (h @ w) @ (h @ x)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.44/0.68 thf(c_0_7, plain, ![X1:binary1439146945Tree_a, X2:a, X79:a > int, X4:a, X3:binary1439146945Tree_a]:(((ord_less_int @ (X79 @ X2) @ (X79 @ X4))|~((member_a @ X2 @ (binary945792244etOf_a @ X1)))|~((binary1721989714Tree_a @ X79 @ (binary717961607le_T_a @ X1 @ X4 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.44/0.68 thf(c_0_8, plain, (binary1721989714Tree_a @ h @ (binary717961607le_T_a @ t1 @ x @ t2)), inference(split_conjunct,[status(thm)],[fact_1_s])). 0.44/0.68 thf(c_0_9, negated_conjecture, ~((ord_less_int @ (h @ w) @ (h @ x))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.44/0.68 thf(c_0_10, plain, ![X2:a]:(((ord_less_int @ (h @ X2) @ (h @ x))|~((member_a @ X2 @ (binary945792244etOf_a @ t1))))), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.44/0.68 thf(c_0_11, plain, (member_a @ w @ (binary945792244etOf_a @ t1)), inference(split_conjunct,[status(thm)],[fact_0_whSet])). 0.44/0.68 thf(c_0_12, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11])]), ['proof']). 0.44/0.68 # SZS output end CNFRefutation 0.44/0.68 # Parsed axioms : 394 0.44/0.68 # Removed by relevancy pruning/SinE : 98 0.44/0.68 # Initial clauses : 617 0.44/0.68 # Removed in clause preprocessing : 13 0.44/0.68 # Initial clauses in saturation : 604 0.44/0.68 # Processed clauses : 1407 0.44/0.68 # ...of these trivial : 28 0.44/0.68 # ...subsumed : 406 0.44/0.68 # ...remaining for further processing : 973 0.44/0.68 # Other redundant clauses eliminated : 142 0.44/0.68 # Clauses deleted for lack of memory : 0 0.44/0.68 # Backward-subsumed : 3 0.44/0.68 # Backward-rewritten : 8 0.44/0.68 # Generated clauses : 3002 0.44/0.68 # ...of the previous two non-redundant : 2596 0.44/0.68 # ...aggressively subsumed : 0 0.44/0.68 # Contextual simplify-reflections : 1 0.44/0.69 # Paramodulations : 2745 0.44/0.69 # Factorizations : 2 0.44/0.69 # NegExts : 9 0.44/0.69 # Equation resolutions : 151 0.44/0.69 # Total rewrite steps : 655 0.44/0.69 # Propositional unsat checks : 0 0.44/0.69 # Propositional check models : 0 0.44/0.69 # Propositional check unsatisfiable : 0 0.44/0.69 # Propositional clauses : 0 0.44/0.69 # Propositional clauses after purity: 0 0.44/0.69 # Propositional unsat core size : 0 0.44/0.69 # Propositional preprocessing time : 0.000 0.44/0.69 # Propositional encoding time : 0.000 0.44/0.69 # Propositional solver time : 0.000 0.44/0.69 # Success case prop preproc time : 0.000 0.44/0.69 # Success case prop encoding time : 0.000 0.44/0.69 # Success case prop solver time : 0.000 0.44/0.69 # Current number of processed clauses : 428 0.44/0.69 # Positive orientable unit clauses : 110 0.44/0.69 # Positive unorientable unit clauses: 5 0.44/0.69 # Negative unit clauses : 103 0.44/0.69 # Non-unit-clauses : 210 0.44/0.69 # Current number of unprocessed clauses: 2220 0.44/0.69 # ...number of literals in the above : 5590 0.44/0.69 # Current number of archived formulas : 0 0.44/0.69 # Current number of archived clauses : 452 0.44/0.69 # Clause-clause subsumption calls (NU) : 76696 0.44/0.69 # Rec. Clause-clause subsumption calls : 21240 0.44/0.69 # Non-unit clause-clause subsumptions : 144 0.44/0.69 # Unit Clause-clause subsumption calls : 1471 0.44/0.69 # Rewrite failures with RHS unbound : 0 0.44/0.69 # BW rewrite match attempts : 221 0.44/0.69 # BW rewrite match successes : 124 0.44/0.69 # Condensation attempts : 1407 0.44/0.69 # Condensation successes : 3 0.44/0.69 # Termbank termtop insertions : 100618 0.44/0.69 0.44/0.69 # ------------------------------------------------- 0.44/0.69 # User time : 0.167 s 0.44/0.69 # System time : 0.008 s 0.44/0.69 # Total time : 0.175 s 0.44/0.69 # Maximum resident set size: 4920 pages 0.44/0.69 0.44/0.69 # ------------------------------------------------- 0.44/0.69 # User time : 0.181 s 0.44/0.69 # System time : 0.010 s 0.44/0.69 # Total time : 0.191 s 0.44/0.69 # Maximum resident set size: 2544 pages 0.44/0.69 % E---3.1 exiting 0.44/0.69 EOF